Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
نویسندگان
چکیده
منابع مشابه
Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T ) and O(T ) time algorithms respectively for the case with production capacity multiple of the batch siz...
متن کاملPolynomial time algorithms for constant capacitated single-item lot sizing problem with stepwise production cost
This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T 4) and O(T 6) time algorithms respectively for the case with production capacity multiple of the batch s...
متن کاملThree Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)
This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...
متن کاملAn FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ε in time polynomial in the problem size and in 1/ε. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) producti...
متن کاملThree Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2012
ISSN: 0167-6377
DOI: 10.1016/j.orl.2012.05.003